Stability of Maximal Size Matching Scheduling in Input-Queued Cell Switches
نویسندگان
چکیده
We consider cell-based switch architectures in which the speedup of the internal switching fabric is not large enough to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred towards output ports. The stability properties of Maximal Size Matching (MSM) scheduling algorithms are studied in the paper, using analytical techniques primarily based upon Lyapunov functions. The main result of the paper is the proof that, for a wide class of MSM scheduling algorithms, stability is guaranteed by an internal switch speedup equal to two.
منابع مشابه
Distributed Scheduling Policies of Low Complexity for Networks of Input-Queued Switches
Scheduling algorithms for input-queued switches have been widely researched. It has been shown that various classes of scheduling algorithms guarantee the stability of single switches. However, recent research has demonstrated that most of these scheduling algorithms do not the guarantee stability for networks of switches. Most of the research that treats networks of switches proposes switching...
متن کاملStable local scheduling policies in networks of input-queued switches
Most research on switch architectures and scheduling algorithms has focused on single switches. It is well known that certain scheduling policies that are based on maximum weight matching algorithms guarantee the stability of single switches. However, recent research has shown that most of these scheduling policies do not guarantee the stability of networks of input-queued switches. So far, onl...
متن کاملA Delay Analysis of Maximal Matching Switching with Speedup
In this paper we analyze the average queue lengths in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare these average queue lengths to the average queue lengths achieved by an optimal switch. We model the cell arrival process as independent and identically distributed between time slots and uniformly distributed among input and output ports. Fo...
متن کاملPacket Scheduling in Input-Queued Cell-Based Switches
Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for input-queued cell switches, operating on fixed-size data u...
متن کاملDegree-sequenced matching algorithms for input-queued switches
This paper presents a class of algorithms for scheduling packets in input-queued switches. As opposed to previously known algorithms that focus only on achieving high throughput, these algorithms seek to achieve low average delay without compromising the throughput achieved. Packet scheduling in input-queued switches based on the virtual-output-queued architecture is a bipartite graph matching ...
متن کامل